On Solving Binate Covering Problems
نویسنده
چکیده
Binate (or unate) covering problems occur at several steps during logic synthesis including two-level minimization and DAG covering. This paper presents a better lower bound computation algorithm and two new pruning techniques that significantly improve the efficiency of binate covering problem solvers. We show that these techniques reduce by up to three orders of magnitude the time required to solve binate covering problems exactly.
منابع مشابه
Technology mapping by binate covering
Technology mapping can be viewed as the optimization problem of finding a minimum cost cover of the given Boolean network by choosing from given library of logic cells. The core of this problem in turn can be formulated as the binate covering problem that is NP-hard. A number of heuristics solving the binate covering problem has been proposed. However, no experimental comparison of efficiency o...
متن کاملExplicit and implicit algorithms for binate covering problems
We survey techniques for solving binate covering problems, an optimization step often occurring in logic synthesis applications. Standard exact solutions are found with a branchand-bound exhaustive search, made more efficient by bounding away regions of the search space. Standard approaches are said to be explicit because they work on a direct representation of the binate table, usually as a ma...
متن کاملOn Solving Boolean Optimization with Satisfiability-Based Algorithms
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Computer Science and Engineering. In Artificial Intelligence, BCP can be used for computing minimum-size prime implicants of Boolean functions, of interest in Automated Reasoning and Non-Monotonic Reasoning. Binate Coverin...
متن کاملImproving Satisfiability Algorithms with Dominance and Partitioning
In this paper we describe how several search pruning concepts, commonly used in algorithms for solving covering problems, can be incorporated in algorithms for propositional satisfiability (SAT). In particular, we show that the concepts of row dominance and matrix partitioning, commonly used for solving unate and binate covering problems, can be naturally applied to SAT algorithms. Experimental...
متن کاملSearch Pruning Conditions for Boolean Optimization
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Computer Science and Engineering. In Artificial Intelligence, BCP can be used for computing minimum-size prime implicants of Boolean functions, of interest in Automated Reasoning and Non-Monotonic Reasoning. Moreover, Bina...
متن کامل